[livres divers classés par sujet] [Informatique] [Algorithmique] [Programmation] [Mathématiques] [Hardware] [Robotique] [Langage] [Intelligence artificielle] [Réseaux]
[Bases de données] [Télécommunications] [Chimie] [Médecine] [Astronomie] [Astrophysique] [Films scientifiques] [Histoire] [Géographie] [Littérature]

Scalable and Reliable Multicast ACK Tree Construction wit the Token Repository Service

title Scalable and Reliable Multicast ACK Tree Construction wit the Token Repository Service
creator Maihöfer, Christian
date 2000-09
language eng
identifier  http://www.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2000-10&engl=1
description Reliable multicast is realized in a scalable way by tree based approaches, where the receivers are organized in an ACK tree. Usually, expanding ring search (ERS) is used to create such ACK trees. However, ERS has some shortcomings like poor scalability, strong dependency on the multicast routing protocol and the need for bidirectional multicast capable networks, which makes it difficult to use ERS as the Internet standard mechanism. In this paper we propose the Token Repository Service (TRS), which is based on a token repository and a modification of ERS. The TRS stores tokens, which represents the right for a joining node to connect to a certain parent node in the ACK tree. Performance evaluations show that the TRS approach has several advantageous compared to ERS, like improved scalability and independence of the routing protocol.
publisher Singapore: IEEE Press
type Text
Article in Proceedings
source In: IEEE (ed.): Proceedings of the 8th IEEE International Conference on Networks (ICON 2000), pp. 351-358
ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2000-10/INPROC-2000-10.pdf
contributor Verteilte Systeme (IPVR)
format application/pdf
159195 Bytes
subject Computer-Communication Networks (CR C.2)